Ready to preorder: an algebraic and general proof
نویسندگان
چکیده
منابع مشابه
Ready to preorder: an algebraic and general proof
There have been quite a few proposals for behavioural equivalences for concurrent processes, and many of them are presented in Van Glabbeek’s linear timebranching time spectrum. Since their original definitions are based on rather different ideas, proving general properties of them all would seem to require a case-bycase study. However, the use of their axiomatizations allows a uniform treatmen...
متن کاملReady to Preorder: Get Your BCCSP Axiomatization for Free!
This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulati...
متن کاملReady to preorder: The case of weak process semantics
Recently, Aceto, Fokkink & Ingólfsdóttir proposed an algorithm to turn any sound and ground-complete axiomatisation of any preorder listed in the linear time – branching time spectrum at least as coarse as the ready simulation preorder, into a sound and ground-complete axiomatisation of the corresponding equivalence—its kernel. Moreover, if the former axiomatisation is ω-complete, so is the lat...
متن کاملAn Algebraic Approach to Proof Search in Sequent Calculi
Inference rules in the sequent calculus can be interpreted as both proof construction rules and proof search rules. However, the kind of information used in each case is somewhat different. In this paper we explore these differences by using a multiple-conclusioned sequent calculus for intuitionistic logic (LM) as a search calculus for proofs in the single-conclusioned intuitionistic sequent ca...
متن کاملAn Algebraic Proof of Deuber's Theorem
Deuber’s Theorem says that, given any m, p, c, r in N, there exist n, q, μ in N such that whenever an (n, q, c)-set is r-coloured, there is a monochrome (m, p, c)-set. This theorem has been used in conjunction with the algebraic structure of the StoneČech compactification βN of N to derive several strengthenings of itself. We present here an algebraic proof of the main results in βN and derive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2009
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2008.09.001